Decidability and Np-Completeness for Somelanguages Which Extend Boolean Set Theory
نویسندگان
چکیده
We prove the decidability for a class of languages which extend BST and NP-completeness subclass them. The extended with unordered cartesian product, ordered product powerset fall in this last subclass.
منابع مشابه
NP-completeness of small conflict set generation for congruence closure
The efficiency of satisfiability modulo theories (SMT) solvers is dependent on the capability of theory reasoners to provide small conflict sets, i.e. small unsatisfiable subsets from unsatisfiable sets of literals. Decision procedures for uninterpreted symbols (i.e. congruence closure algorithms) date back from the very early days of SMT. Nevertheless, to the best of our knowledge, the complex...
متن کاملComplexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملNP - Completeness : Clique , Vertex Cover , and Dominating Set Thursday
Vertex Cover (VC): A vertex cover in an undirected graph G = (V,E) is a subset of vertices V ′ ⊆ V such that every edge in G has at least one endpoint in V ′. The vertex cover problem (VC) is: given an undirected graph G and an integer k, does G have a vertex cover of size k? Dominating Set (DS): A dominating set in a graph G = (V,E) is a subset of vertices V ′ such that every vertex in the gra...
متن کاملCompleteness in Operational Set Theory
This note is concerned with operational set theory, a concept that was introduced in Sanchis [8], via the sysstem G, a partially formalized set theory. The leit motiv of this approach is the predicativity principle, that we understand as a general principle in the sense that the universe of sets is not a well defined totality, and quantification over the universe may be allowed only under sever...
متن کاملUsing Interactive Visualization for Teaching the Theory of Np-completeness
In this paper we investigate the potential of interactive visualiza-tion for teaching the theory of NP-completeness to undergraduate students of computer science. Based on this analysis we developed some interactive Java applets which we use to present an NP-complete tiling problem PUZZLE in our lecture. This software is integrated into our hypertext lecture notes and our students also use it t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4065312